Layered Multicast Scheduling for the L∞ Objective

نویسندگان

  • Qingbo Cai
  • Vincenzo Liberatore
چکیده

Layered multicast is a scalable solution to data dissemination over the Internet. The performance of layered multicast hinges upon the transmission schedule. In this paper, we study the scheduling problem in the layered multicast context. This work generalizes the extensively studied multicast scheduling problem (layered and non-layered) by introducing simultaneously the data popularity and the interaction among layers, and addresses the strictest L∞ objective, i.e., to find a schedule which is good for all individual layers. Compared to the previous work, this paper presents a polynomial-time approximation algorithm that uses a different approach and can address the general layered multicast scheduling problem with an arbitrary number of layers. This algorithm is 1.334-approximation for the twolayer case and 1.862-approximation for the general multi-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resourceallocation Algorithms Forqos Optimization Inmobile Wimaxnetworks

WiMAX is based on the standard IEEE 802.16e-2009 for wireless access in Metropolitan Area Networks. It is one of the solutions for 4G IP based wireless technology. WiMAX utilizes Orthogonal Frequency Division Multiple Access which also supports Multicast and Broadcast Service with appropriate Modulation and Coding Scheme. Presently, Scheduling and Resource allocation algorithm in Opportunistic ...

متن کامل

Discrete bandwidth allocation considering fairness and transmission load in multicast networks

As a promising solution to tackle the network heterogeneity in multicasting, layered multicast protocols such as Receiver-driven layered multicast (RLM) and Layered video multicast with retransmission (LVMR) have been proposed. This paper considers fairness as well as transmission load in the layered multicasting. Lexicographically fair bandwidth allocation among multicast receivers is consider...

متن کامل

Layered Multicast Rate Control using Lagrangian Relaxation and Dynamic Programming

In this paper, we address the rate control problem for layered multicast sessions, with the objective of solving a generalized throughput/fairness objective. Our approach is based on a combination of lagrangian relaxation and dynamic programming. Unlike previously proposed dual-based approaches, the algorithm presented in this paper scales well as the number of multicast groups in the network i...

متن کامل

Trade-off between fairness and stability in layered video multicast

Layered multicast is a promising technique for distributing video to a set of heterogeneous receivers. While several layered multicast approaches have been proposed, prior work usually perform adaptation on the receiver’s side and use static rate allocation techniques at the sender’s side. In this paper, we show an adaptation framework that improves stability and fairness of receivers by employ...

متن کامل

Multicast Rate Control under Discrete Bandwidth Constraints

In this paper, we address the rate control problem for layered multicast sessions, with the objective of solving a generalized throughput/fairness objective. Our approach is based on a combination of Lagrangian relaxation and dynamic programming. Unlike previously proposed dual-based approaches, the algorithm presented in this paper scales well as the number of multicast sessions in the network...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006